#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void)
{
  LL t;cin>>t;
  while(t--){
    LL a,b;cin>>a>>b;
    LL sum=0;
    for(LL k=1;k*(k+2)<=a;k++){
        LL bmaxv=min(b,a/k-1);
        LL bminv=k+1;
        if(bmaxv>=bminv){
            sum+=bmaxv-bminv+1;
        }
    }
    cout<<sum<<"\n";
  }
return 0;
}
